Matroids denser than a clique
نویسندگان
چکیده
منابع مشابه
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique complex of a graph (the collection of all cliques of the graph) which is also called a flag complex, and investigate the minimum number k such that the clique complex of a given graph can be represented as the intersect...
متن کاملExcluding a bipartite circle graph from line graphs
We prove that for fixed bipartite circle graph H, all line graphs with sufficiently large rank-width (or clique-width) must contain an isomorphic copy of H as a pivotminor. To prove this, we introduce graphic delta-matroids. Graphic delta-matroids are minors of delta-matroids of line graphs and they generalize graphic or cographic matroids.
متن کاملAn Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملM ay 2 00 9 An obstacle to a decomposition theorem for near - regular matroids ∗
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملCOMPUTATION OF LINEAR RANK-WIDTH Keywords: linear rank-width; rank-decomposition; path-decomposition; vertex-minor Internship at Limos, Clermont-Ferrand, supervised by
(1) It is equivalent to clique-width, a complexity measure introduced by Courcelle et al. [4], that generalises the well-known complexity measure tree-width introduced by Robertson and Seymour in their graph minors series. (2) It is algorithmically more interesting than clique-width because we can recognise in polynomial time graphs of rank-width at most k (for fixed k) (3) It shares with tree-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 114 شماره
صفحات -
تاریخ انتشار 2015